A Class of Real Expander Codes Based on Projective- Geometrically Constructed Ramanujan Graphs
نویسندگان
چکیده
Quite recently, codes based on real field are gaining momentum in terms of research and applications. In high-performance computing, these codes are being explored to provide fault tolerance under node failures. In this paper, we propose novel real cycle codes based on expander graphs. The requisite graphs are the Ramanujan graphs constructed using incidence matrices of the appropriate projective-geometric objects. The proposed codes are elegant in terms of reduced complexity encoding and very simple erasure correction. Further, the codes are guaranteed to correct three erasures. Apart from building the codes from the sound existing principles, necessary simulation results and justification of the useful properties are also presented in the paper.
منابع مشابه
Algorithms for generation of Ramanujan graphs, other Expanders and related LDPC codes
Expander graphs are highly connected sparse nite graphs. The property of being an expander seems signi cant in many of these mathematical, computational and physical contexts. For practical applications it is very important to construct expander and Ramanujan graphs with given regularity and order. In general, constructions of the best expander graphs with a given regularity and order is no eas...
متن کاملHighly Symmetric Expanders
Expander graphs are relevant to theoretical computer science in addition to the construction of high-performance switching networks. In communication network applications, a high degree of symmetry in the underlying topology is often advantageous, as it may reduce the complexity of designing and analyzing switching and routing algorithms. We give explicit constructions of expander graphs that a...
متن کاملOptimal Cycle Codes Constructed From Ramanujan Graphs
We aim here at showing how some known Ramanujan Cayley graphs yield error-correcting codes that are asymptotically optimal in the class of cycle codes of graphs. The main reason why known constructions of Ramanujan graphs yield good cycle codes is that the number of their cycles of a given length behaves essentially like that of random regular graphs. More precisely we show that for actual cons...
متن کاملSome new Algebraic constructions of Codes from Graphs which are good Expanders∗
The design of LDPC codes based on a class of expander graphs is investigated. Graph products, such as the zig-zag product [9], of smaller expander graphs have been shown to yield larger expanders. LDPC codes are designed based on the zigzag product graph of two component Cayley graphs. The results for specific cases simulated reveal that the resulting LDPC codes compare well with other random L...
متن کاملThe zig-zag product
The expander constructions based on algebraic methods can give expanders that are both explicit (i.e. we can quickly construct the graph, or even obtain neighborhood information without constructing the entire graph, and Ramanujan, meaning that the spectral gap is essentially as large as possible. It also follows from this spectral bound that the edge expansion of Ramanujan graphs is essentiall...
متن کامل